Definability and textures

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Naturality and Definability Ii

In two papers [3] and [4] we noted that in common practice many algebraic constructions are defined only ‘up to isomorphism’ rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper provides much fuller answers, though some questions remain open. Our main result, Theorem 4, says that there is a transitive model of Zermelo-Fraen...

متن کامل

Definability and Full Abstraction

Game semantics has renewed denotational semantics. It offers among other things an attractive classification of programming features, and has brought a bunch of new definability results. In parallel, in the denotational semantics of proof theory, several full completeness results have been shown since the early nineties. In this note, we review the relation between definability and full abstrac...

متن کامل

Computability and -definability

Recent advances in distributed models and semantic epistemologies are never at odds with RAID [114, 188, 62, 70, 179, 68, 95, 54, 152, 191, 62, 59, 168, 148, 99, 58, 129, 128, 106, 191]. Given the current status of embedded epistemologies, security experts daringly desire the construction of thin clients. In order to solve this obstacle, we concentrate our efforts on arguing that e-commerce and...

متن کامل

Circumscription and Definability

Thanks to two stronger versions of predicate circumscription (one of the best known non-monotonic reasoning methods), we give a definitive answer to two old open problems. The first one is the problem of expressing domain circumscription in terms of predicate circumscription. The second one is the problem of definability of the circumscribed predicates, asked by Doyle in 1985, and never answere...

متن کامل

Definability and Process Ontologies

In this paper, we use the notions of relative interpretations and definable models from mathematical logic to compare different ontologies and also to evaluate the limitations of particular ontologies. In particular, we characterize the relationship between the theories within the first-order PSL Ontology and two other ontologies – a first-order theory of time and Reiter’s second-order axiomati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 2012

ISSN: 0888-613X

DOI: 10.1016/j.ijar.2011.12.007